Stateful applied pi calculus: Observational equivalence and labelled bisimilarity
نویسندگان
چکیده
منابع مشابه
Stateful Applied Pi Calculus
We extend the applied pi calculus with state cells, which are used toreason about protocols that store persistent information. Examples are protocolsinvolving databases or hardware modules with internal state. We distinguish be-tween private state cells, which are not available to the attacker, and public statecells, which arise when a private state cell is compromised by the at...
متن کاملOn the Coincidence of Observational Equivalence and Labeled Bisimilarity in Applied Pi Calculus
However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [2]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces the nondeterminism, which makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate se...
متن کاملA Proof of Coincidence of Labeled Bisimilarity and Observational Equivalence in Applied Pi Calculus
However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [3]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces many possibilities and makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate seman...
متن کاملApplied pi calculus
The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational equivalence properties, with examples showing how to model secrecy, authentication, and privacy a...
متن کاملA Probabilistic Applied Pi-Calculus
We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nondeterministic choice among the probability distributions over target states. Notions of static and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2017
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2017.03.001